On Splitting a Systematic Sample for Variance Estimation
نویسندگان
چکیده
منابع مشابه
Resampling Variance Estimation for a Two-Phase Sample
Two-phase sampling is often used in a wide variety of surveys. Variance estimation from a two-phase sample has been a subject of active research. The re-sampling method of variance estimation has been used for this problem. However, the method confronts a challenging problem when the first phase sampling fraction is high. In the extreme (but not uncommon) case some first-phase strata are take-a...
متن کاملImproved variance estimation along sample eigenvectors
Second order statistics estimates in the form of sample eigenvalues and sample eigenvectors give a sub optimal description of the population density. So far only attempts have been made to reduce the bias in the sample eigenvalues. However, because the sample eigenvectors differ from the population eigenvectors as well, the population eigenvalues are biased estimates of the variances along the ...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملchannel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
Exact Bounds on Sample Variance ofInterval
We provide a feasible (quadratic time) algorithm for computing the lower bound V on the sample variance of interval data. The problem of computing the upper bound V is, in general, NP-hard. We provide a feasible algorithm that computes V for many reasonable situations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1971
ISSN: 0003-4851
DOI: 10.1214/aoms/1177693336